Cyclic Evaluation of Transitivity of Reciprocal Relations
نویسندگان
چکیده
A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluation of transitivity: triangles (i.e. any three points) are visited in a cyclic manner. An upper bound function acting upon the ordered weights encountered provides an upper bound for the ‘sum minus 1’ of these weights. Commutative quasi-copulas allow to translate a general definition of fuzzy transitivity (when applied to reciprocal relations) elegantly into the framework of cycletransitivity. Similarly, a general notion of stochastic transitivity corresponds to a particular class of upper bound functions. Ample attention is given to self-dual upper bound functions.
منابع مشابه
Self-dual types of cycle-transitivity
A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluation of transitivity: triangles (i.e. any three points) are visited in a cyclic manner. An upper bound function acting upon the ordered weights encountered provides an upper bound for the ‘sum minus 1’ of these weights. Commutative quasi-copulas allow to translate a genera...
متن کاملOn the transitive closure of reciprocal [0, 1]-valued relations
We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or st...
متن کاملOn Some New Forms of Cycle-Transitivity and Their Relation to Commutative Copulas
Recently, we introduced the framework of cycletransitivity as a general means of representing transitivity conditions on reciprocal relations. In this framework, for reciprocal relations, the concepts of T -transitivity and stochastic transitivity can be cast. The upper bound functions encountered in this framework for product-transitivity and dice-transitivity, conceptually related to the prob...
متن کاملLearning intransitive reciprocal relations with kernel methods
In different fields like decision making, psychology, game theory and biology, it has been observed that paired-comparison data like preference relations defined by humans and animals can be intransitive. Intransitive relations cannot be modeled with existing machine learning methods like ranking models, because these models exhibit strong transitivity properties. More specifically, in a stocha...
متن کاملA generalization of stochastic and fuzzy transitivity for reciprocal fuzzy relations
b) moderate stochastic transitivity: For a reciprocal fuzzy relation Q : x2 + [O, 11 on a finite set of alternatives X , we introduce the concept of U-transitivity which is based upon the ordering of the matrix elements qij, qjk and qki of Q for all triples of indices i, j and k. We show that U-transitivity generalizes both stochastic and fuzzy transitivity. The U-transitivity of the secalled u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 26 شماره
صفحات -
تاریخ انتشار 2006